Synchronization framework that restores a node from backup

ABSTRACT

Architecture for restoring nodes. After restoring a node, fix-up occurs to make the node appears as a different node than before the restore operation. The node appears as a new node, which new node knows the data up to a certain point from when the new node had the prior identity. This allows for new changes generated by the new node to flow to the other nodes in the topology, as well as have the changes that the prior identity sent to other nodes flow back to the new node. In other words, the architecture maintains information to create the new node in the topology while maintaining prior data knowledge. Additionally, item level metadata of associated data items is updated to correlate with the updated data items so that changes can be correctly enumerated and applied. This metadata update occurs across scopes of which the data items are included.

BACKGROUND

Data backup is essential to the individual user as well as to thecorporate entity. Data stores can now be found on client machines aswell as distributed corporate-wide across servers. Thus, consumersdesire the capability to backup and restore both client-side databasesas well as server-side database to guard against data loss related. Dataloss can occur due to many reasons, some of which include databasecorruption, hardware failures, unintended operations, and disasterrecovery.

Moreover, the behavior of client-side and server-side stores can bedifferent and, as such, result in a different set of requirementsrelated to backup/restore scenarios. Specifically, client-side storestypically share characteristics that include limited concurrency,single-user data access, flexibility during downtime, and limitationsrelated to backup capabilities (e.g., online, incremental, etc.). Incontrast, server-side databases typically share characteristics thatinclude a high degree of concurrency, multi-user user data access, highavailability, and a wide array of backup capabilities.

Endpoint synchronization is a challenging prospect. One techniqueinvolves synchronization by maintaining version information about thedata being synchronized. When an endpoint needs to be restored frombackup due to hardware or software failure, the version information forthe data that lives on that node must be repaired to preventpost-restore changes from being missed when sending changes to clients.However, if a node is restored to a point in time that causes the localtimestamp to go backward to a time prior, then the node creates “new”changes that have a version which will look old to clients that weresynchronizing with this node prior to restore, causing non-convergence.

SUMMARY

The following presents a simplified summary in order to provide a basicunderstanding of some novel embodiments described herein. This summaryis not an extensive overview, and it is not intended to identifykey/critical elements or to delineate the scope thereof. Its solepurpose is to present some concepts in a simplified form as a prelude tothe more detailed description that is presented later.

The disclosed architecture is a versioning solution for synchronizingendpoints. After restoring an endpoint some fix-up occurs to make thatendpoint look like a different endpoint than before the restoreoperation. In this case, the endpoint looks like a new endpoint thatknows the data from its prior identity up to a certain point. Thisallows for new changes generated by the new endpoint to flow to theother endpoints in the topology, as well as have the changes that theprior identity sent to other clients flow back to the new endpoint.

In other words, the architecture maintains information to create the“new” node in the topology while maintaining prior knowledge.Additionally, item level metadata is updated to correlate with theupdated knowledge so that changes can be correctly enumerated andapplied.

To the accomplishment of the foregoing and related ends, certainillustrative aspects are described herein in connection with thefollowing description and the annexed drawings. These aspects areindicative of the various ways in which the principles disclosed hereincan be practiced and all aspects and equivalents thereof are intended tobe within the scope of the claimed subject matter. Other advantages andnovel features will become apparent from the following detaileddescription when considered in conjunction with the drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates a computer-implemented data restoration system inaccordance with the disclosed architecture.

FIG. 2 illustrates the change to the identity of the node based onintroduction of a new identity for the node.

FIG. 3 illustrates a system that facilitates metadata update accordingto scope.

FIG. 4 illustrates a computer-implemented data restoration method inaccordance with the disclosed architecture.

FIG. 5 illustrates further aspects of the method of FIG. 4.

FIG. 6 illustrates an alternative data restoration method beginning withthe post-restore process.

FIG. 7 illustrates an alternative data restoration method in accordancewith the disclosed architecture.

FIG. 8 illustrates further aspects of the method of FIG. 7.

FIG. 9 illustrates a block diagram of a computing system that executesnode restoration and synchronization in accordance with the disclosedarchitecture.

DETAILED DESCRIPTION

The disclosed architecture restores a node by changing the original nodeidentity to a new identity (and hence, a new node), which triggerssynchronization between some or all of the nodes of not only prior nodedata stored on the other nodes for pre-restore operations, but also nodedata associated with the new identity post-restore. This allows for newchanges generated by the new node to flow to the other nodes in thetopology, as well as have the changes that the original identity sent toother clients flow back to the new node.

Reference is now made to the drawings, wherein like reference numeralsare used to refer to like elements throughout. In the followingdescription, for purposes of explanation, numerous specific details areset forth in order to provide a thorough understanding thereof. It maybe evident, however, that the novel embodiments can be practiced withoutthese specific details. In other instances, well known structures anddevices are shown in block diagram form in order to facilitate adescription thereof. The intention is to cover all modifications,equivalents, and alternatives falling within the spirit and scope of theclaimed subject matter.

FIG. 1 illustrates a computer-implemented data restoration system 100 inaccordance with the disclosed architecture. The system 100 includes arestore component 102 that restores a node (N_(A)) 104 in a topology 106to a restored state. The node 104 has a node identity 108. An identitycomponent 110 changes the identity 108 of the node 104 to a new identity(New Identity_(D)) 112. Thus, the node 104 appears to the other nodes(N_(B) and N_(C)) in the topology 106 as a new node (N_(D)) 114 based onthe new identity 112. A synchronization component 116 synchronizes datafrom the other nodes (N_(B) and N_(C)) to the node 104 (since it isactually the node 104 that has the new identity 112) based on the newidentity 112 to bring the node 104 to an updated state.

The identity component 110 changes the identity 108 of the node 104 byincreasing a local peer value of a key map associated with the node 104and updating key maps of all topology nodes based on the new identity112. The synchronization component 116 synchronizes data changes fromthe node 104 to the other nodes (N_(B) and N_(C)) and synchronizeschanges from the other nodes (N_(B) and N_(C)) to the node 104 based onthe new identity 112. The new identity 112 is created as an incrementalincrease in a local peer value and new node identifier. The restorecomponent 102 restores data item metadata based on the restored node104, and data item metadata across scopes that include the data item.

FIG. 2 illustrates nodes and node key maps 200 and the change to theidentity of the node 104 based on introduction of a new identity for thenode. In one topology implementation knowledge objects include a replicakey map that is used to identify nodes in a synchronization topology.The key map can be represented as a <key value, GUID identifier₁, GUIDidentifier₂, . . . , GUID identifier_(N),> tuple, where N is the totalnumber of nodes in the topology or an alphabetic designation in thisexample. A replica is a globally unique identifier (GUID) that a nodeself assigns. A key is an index into a list of replicas that is usedlocally by the node 104 to reference other node replicas.

Consider the topology 106 (of FIG. 1) that includes three nodes: node104, node (N_(B)) 202, and node (N_(C)) 204. A replica key map 206 fornode 104 can be (0:GuidA, 1:GuidB, 2:GuidC). This information indicatesthat there are three nodes in the topology: the node 104 (having theGUID identifier GuidA), node 202 (having the GUID identifier GuidB), andnode 204 (having the GUID identifier GuidC). The key value zero for node104 is the local peer value. Therefore, the replica for node 104 isGuidA.

The replica key maps for the remaining nodes are the following, showingthree positions (0,1,2). The node 202 has a replica key map 208 (denoted(0:GuidB, 1:GuidC, 2:GuidA)) reflecting that the replica is GuidB, andthe node 204 has a replica key map 210 (denoted (0:GuidC, 1:GuidA,2:GuidB)) reflecting that the replica is GuidC.

After performing a restore of the data, the node replica is changed toreflect that this node is different (the new node 114) than the nodethat existed before restore. The reasons for doing this are so that dataitems altered by the new node 114 appear to be new to all other nodes(e.g., node 202 and node 204), and changes made by the “old” node 104(“old” meaning the before restore replica) that were not captured in thebackup, will flow back to the new node 114.

This is accomplished by redefining key zero in the replica key map 206to be a new replica. This is performed by shifting the existing entriesin the replica key map 206, to the right, for example, therebyincreasing the map keys by one, and then inserting the new replica(GuidD) at position zero.

Thus, given the above example, pre-restore replica key map of node 104is (0:GuidA, 1:GuidB, 2:GuidC), where GuidA is the local replicaidentifier. The post-restore replica key map 212 now include fourpositions (0, 1, 2, 3) and is (0:GuidD, 1:GuidA, 2:GuidB, 3GuidC), whereGuidD is now the local replica identifier.

Since the versions for data items are stored in terms of (key,tickcount), where tickcount can be an integer, all item level metadataneeds to have its associated key incremented by one to reflect the shiftin the key map. Therefore, a data item that was created by replica GuidAand had a version of fifty is represented in the item metadata as (0,50), where zero is the old replica key of the node 104. After the shift,this updated data item is reflected as (1, 50), since GuidA is now atposition one in the key map.

This re-identification allows changes made by the new node replica GuidDto flow to other nodes, since GuidD appears to represent be a new nodewith new changes. This re-identification also allows changes made by thenode 104 having GuidA to flow back to the new node 114 having replicaGuidD, thereby allowing the changes made after the backup of the node104 was taken to flow back and bring the restored node 104 back up todate.

FIG. 3 illustrates a system 300 that facilitates metadata updateaccording to scope. The restoration and synchronization frameworkdefines a protocol for synchronizing a collection of nodes. For example,in one implementation, each unit (data item(s)) of synchronization isreferred to as a “scope”, and specifies the data that is to besynchronized. Nodes interested in a particular set of data are added tothe scope that contains that data. All nodes within a scope synchronizethe same set of data amongst themselves. This is achieved by maintainingversion information about the data being synchronized.

When a node needs to be restored from backup due to hardware or softwarefailure, the version information for the data that is stored on thatnode is repaired to prevent post-restore changes from being missed whensending changes to other nodes. Consider a node A, and that node A hassent out an item with version (A,50), where fifty is a local timestampfor time at which the change was made. If node A is restored to a pointin time that causes its local timestamp to go backward (earlier in time)so as to precede fifty, such as (A,49), then any “new” changes createdon that node will have the version (A,49) timestamp. This data thenappears as old data to the other nodes that were synchronizing with thisnode prior to restore, thereby causing non-convergence.

This technique described above relative to node restore and updatingapplies as well to cross-scope metadata by updating the knowledge vectorfor every scope on the node. That is, redefine replica key zero to a newGUID, increment the existing keys by one, and then add one to all thekey values that are stored in the side table.

When rows live in multiple scopes and changes were made in one scope,these changes are migrated as being made locally. Consider the followingexample where the scopes are Sales with a pre-remap key length of 4,0-remap value of 5, and Customers scope with a pre-remap key length of100, and 0-remap value of 101, where R₁ is a row, and S_(1,2,3) are thescopes:

R₁εS₁, S₂, S₃

R₁ S₁=(4, 100)

R₁ S₂=(0, 10)

R₁ S₃=(0, 10)

The row was actually changed in S₁; therefore, for the other scopes itappears the change came from the server (0).

After restore, the metadata will look like the following:

R₁εS₁, S₂, S₃

R₁ S₁=(x, 100), where x is the remapped 4 for S₁

R₁ S₂=(i, 10), where i is the remapped 0 for S₂

R₁ S₃=(j, 10), where j is the remapped 0 for S₃

In order avoid storing versions of the metadata for each scope, it isensured that i=j such that inferring the ID is consistent and correctacross scopes. This can be guaranteed by inserting a new replica key inthe map at position zero and shifting all other keys to the right. Thisconsistently maps zero to one across all scopes:

n=1

m=1

K_(S1)=(k′₁₀, k₁₀, k₁₁, . . . , k_(1n))

K_(S2)=(k′₂₀, k₂₀, k₂₁, . . . , k_(2m))

k_(ij)=i is scope number, j is the replica id

Replica ID zero becomes one; more generally, key i becomes i+1.Accordingly, in the example given above, the results are the following:

R₁εS₁, S₂, S₃

R₁ S₁=(5, 100)

R₁ S₂=(1, 10)

R₁ S₃=(1, 10)

In support of metadata updates, a example tracking table (knowledgevector) can include the following (per table metadata gets updatedthrough triggers or as part of synchronization):

Updated on insert to base <primary key of base table> Primary key ofbase table table update_scope_local_id The scope id that originatedUpdated when sync updates the change. Refers to the the metadata row.Updated scope_local_id column in with the scope local id the scope_infotable. associated with the sync. scope_update_peer_key For the scopethat is the Updated when change is update_scope_local_id, the appliedfrom remote peer key ID of who made the updatescope_update_peer_timestamp For the scope that is the Updated whenchange is update_scope_local_id, the applied from remote peer version atID that made the update local_update_peer_key For the scopes that arenot Updated when change is update_scope_local_id, the applied fromremote peer or key ID for proxying the through local DML updatelocal_update_peer_timestamp For the scopes that are not Updated whenchange is update_scope_local_id, the applied from remote peer or versionat the proxying ID through local DML create_scope_local_id The scope idthat originated Updated when an insert is the item. Analogous to appliedfrom remote peer update_scope_local_id but for create versionscope_create_peer_key Analogous to Updated when an insert isscope_update_peer_key but applied from remote peer for insertsscope_create_peer_timestamp Analogous to Updated when change isscope_update_peer_timestamp inserted from remote peer or but for insertsthrough local DML local_create_peer_key Analogous to Updated when changeis local_update_peer_key but inserted from remote peer or for insertsthrough local DML local_create_peer_timestamp Analogous to Updated whenchange is local_update_peer_timestamp inserted from remote peer or butfor inserts through local DML sync_row_is_tombstone Represents whetheror not Updated on deletes on the the row has been deleted base tablefrom the base table last_change_datetime Stores the date and time Anyupdate to the metadata when the metadata row was row changes this value.last updated restore_timestamp This value stores the value TypicallyNULL but set by of restore process. Set to NULLlocal_update_peer_timestamp anytime a row is updated. at the time ofrestore, which is then used as the local update timestamp value.

The system 300 depicts three scopes: a first scope 302, a second scope304, and a third scope 306. The three scopes have corresponding trackingtables: first tracking table 308, second tracking table 310 and thirdtracking table 312. Each scope is associated data for synchronization: afirst set of data 314, a second set of data 316, and a third set of data318.

Here, the nodes listed in association with the first scope 302 includeNode_(A), Node_(B), and Node_(C), which nodes will synch the first setof data 314. Similarly, the nodes listed in association with the secondscope 304 include Node_(A) and Node_(B), which nodes will synch thesecond set of data 316. The nodes listed in association with the thirdscope 306 include Node_(B) and Node_(C), which nodes will synch thethird set of data 318. The tracking tables (308, 310, and 312) track theknowledge vector and changes thereto for each respective scope (302,304, and 306), pre-restore, and post-restore, as facilitates by therestore component 102, identity component 110, and synch component 116.

Included herein is a set of flow charts representative of exemplarymethodologies for performing novel aspects of the disclosedarchitecture. While, for purposes of simplicity of explanation, the oneor more methodologies shown herein, for example, in the form of a flowchart or flow diagram, are shown and described as a series of acts, itis to be understood and appreciated that the methodologies are notlimited by the order of acts, as some acts may, in accordance therewith,occur in a different order and/or concurrently with other acts from thatshown and described herein. For example, those skilled in the art willunderstand and appreciate that a methodology could alternatively berepresented as a series of interrelated states or events, such as in astate diagram. Moreover, not all acts illustrated in a methodology maybe required for a novel implementation.

FIG. 4 illustrates a computer-implemented data restoration method inaccordance with the disclosed architecture. At 400, a node in a topologyis restored to a restored state with restored data. Each node in thetopology has an associated identity. At 402, the identity of the node ischanged to a new identity. The node then appears to other nodes in thetopology as a new node having the new identity. At 404, prior data ofthe node is synchronized from the other nodes to the node based on thenew identity to bring the node to an updated state.

FIG. 5 illustrates further aspects of the method of FIG. 4. At 500, theidentity of the node is changed by changing a key map associated withthe node. At 502, a local peer parameter as part of the key map ischanged to change the node identity. At 504, the identity of the node ischanged by increasing a key value of the key map. At 506, key maps ofthe other nodes are updated to include the new node identity. At 508,restoring, changing, and synchronizing of the new node is applied torestore the new node if the new node fails. At 510, item metadata isupdated to correlate with the updated state of the data items of thenode, for change enumeration. At 512, item metadata of a data item isupdated across multiple scopes that include the data item.

FIG. 6 illustrates an alternative data restoration method beginning withthe post-restore process. At 600, the post-restore process begins. At602, processing is performed for each scope. At 604, for each knowledgevector, a new replica is assigned for key zero and existing keys areincremented by one, as indicated at 606. At 608, the knowledge vectorupdates are concluded. At 610, the knowledge vector updating ends foreach scope. At 612, updating is initiated for each tracking table. At614, all keys in the tracking table are incremented. At 616, trackingtable updates are concluded.

FIG. 7 illustrates an alternative data restoration method in accordancewith the disclosed architecture. At 700, a node in a topology isrestored to a restored state with restored data of data items, the nodehaving an identity. At 702, the identity of the node is changed to a newidentity. The node appears to other nodes in the topology as a new nodebased on the new identity. At 704, data is synchronized from the othernodes to the node based on the new identity to bring the node to anupdated state. At 706, item metadata of a data item is updated acrossmultiple scopes that include the data item.

FIG. 8 illustrates further aspects of the method of FIG. 7. At 800, theidentity of the node is changed by changing a local peer parameter of akey map associated with the node. At 802, the identity of the node ischanged by increasing a key value of the key map. At 804, key maps ofthe other nodes are updated to include the new node identity. At 806,data item metadata is updated to correlate with updated state of thedata of the node for change enumeration. At 808, item metadata of a dataitem is updated across multiple scopes that include the data item. At810, restoring, changing, synchronizing, and updating are applied torestore the new node if the new node fails.

As used in this application, the terms “component” and “system” areintended to refer to a computer-related entity, either hardware, acombination of software and tangible hardware, software, or software inexecution. For example, a component can be, but is not limited to,tangible components such as a processor, chip memory, mass storagedevices (e.g., optical drives, solid state drives, and/or magneticstorage media drives), and computers, and software components such as aprocess running on a processor, an object, an executable, module, athread of execution, and/or a program. By way of illustration, both anapplication running on a server and the server can be a component. Oneor more components can reside within a process and/or thread ofexecution, and a component can be localized on one computer and/ordistributed between two or more computers. The word “exemplary” may beused herein to mean serving as an example, instance, or illustration.Any aspect or design described herein as “exemplary” is not necessarilyto be construed as preferred or advantageous over other aspects ordesigns.

Referring now to FIG. 9, there is illustrated a block diagram of acomputing system 900 that executes node restoration and synchronizationin accordance with the disclosed architecture. In order to provideadditional context for various aspects thereof, FIG. 9 and the followingdescription are intended to provide a brief, general description of thesuitable computing system 900 in which the various aspects can beimplemented. While the description above is in the general context ofcomputer-executable instructions that can run on one or more computers,those skilled in the art will recognize that a novel embodiment also canbe implemented in combination with other program modules and/or as acombination of hardware and software.

The computing system 900 for implementing various aspects includes thecomputer 902 having processing unit(s) 904, a computer-readable storagesuch as a system memory 906, and a system bus 908. The processingunit(s) 904 can be any of various commercially available processors suchas single-processor, multi-processor, single-core units and multi-coreunits. Moreover, those skilled in the art will appreciate that the novelmethods can be practiced with other computer system configurations,including minicomputers, mainframe computers, as well as personalcomputers (e.g., desktop, laptop, etc.), hand-held computing devices,microprocessor-based or programmable consumer electronics, and the like,each of which can be operatively coupled to one or more associateddevices.

The system memory 906 can include computer-readable storage (physicalstorage media) such as a volatile (VOL) memory 910 (e.g., random accessmemory (RAM)) and non-volatile memory (NON-VOL) 912 (e.g., ROM, EPROM,EEPROM, etc.). A basic input/output system (BIOS) can be stored in thenon-volatile memory 912, and includes the basic routines that facilitatethe communication of data and signals between components within thecomputer 902, such as during startup. The volatile memory 910 can alsoinclude a high-speed RAM such as static RAM for caching data.

The system bus 908 provides an interface for system componentsincluding, but not limited to, the system memory 906 to the processingunit(s) 904. The system bus 908 can be any of several types of busstructure that can further interconnect to a memory bus (with or withouta memory controller), and a peripheral bus (e.g., PCI, PCIe, AGP, LPC,etc.), using any of a variety of commercially available busarchitectures.

The computer 902 further includes machine readable storage subsystem(s)914 and storage interface(s) 916 for interfacing the storagesubsystem(s) 914 to the system bus 908 and other desired computercomponents. The storage subsystem(s) 914 (physical storage media) caninclude one or more of a hard disk drive (HDD), a magnetic floppy diskdrive (FDD), and/or optical disk storage drive (e.g., a CD-ROM drive DVDdrive), for example. The storage interface(s) 916 can include interfacetechnologies such as EIDE, ATA, SATA, and IEEE 1394, for example.

One or more programs and data can be stored in the memory subsystem 906,a machine readable and removable memory subsystem 918 (e.g., flash driveform factor technology), and/or the storage subsystem(s) 914 (e.g.,optical, magnetic, solid state), including an operating system 920, oneor more application programs 922, other program modules 924, and programdata 926.

The one or more application programs 922, other program modules 924, andprogram data 926 can include the entities and components of the system100 of FIG. 1, the nodes and key maps 200 of FIG. 2, the entities andcomponents of the system 300 of FIG. 3, and the methods represented bythe flowcharts of FIGS. 4-8, for example.

Generally, programs include routines, methods, data structures, othersoftware components, etc., that perform particular tasks or implementparticular abstract data types. All or portions of the operating system920, applications 922, modules 924, and/or data 926 can also be cachedin memory such as the volatile memory 910, for example. It is to beappreciated that the disclosed architecture can be implemented withvarious commercially available operating systems or combinations ofoperating systems (e.g., as virtual machines).

The storage subsystem(s) 914 and memory subsystems (906 and 918) serveas computer readable media for volatile and non-volatile storage ofdata, data structures, computer-executable instructions, and so forth.The instructions can exist on non-transitory media. Such instructions,when executed by a computer or other machine, can cause the computer orother machine to perform one or more acts of a method. The instructionsto perform the acts can be stored on one medium, or could be storedacross multiple media, so that the instructions appear collectively onthe one or more computer-readable storage media, regardless of whetherall of the instructions are on the same media.

Computer readable media can be any available media that can be accessedby the computer 902 and includes volatile and non-volatile internaland/or external media that is removable or non-removable. For thecomputer 902, the media accommodate the storage of data in any suitabledigital format. It should be appreciated by those skilled in the artthat other types of computer readable media can be employed such as zipdrives, magnetic tape, flash memory cards, flash drives, cartridges, andthe like, for storing computer executable instructions for performingthe novel methods of the disclosed architecture.

A user can interact with the computer 902, programs, and data usingexternal user input devices 928 such as a keyboard and a mouse. Otherexternal user input devices 928 can include a microphone, an IR(infrared) remote control, a joystick, a game pad, camera recognitionsystems, a stylus pen, touch screen, gesture systems (e.g., eyemovement, head movement, etc.), and/or the like. The user can interactwith the computer 902, programs, and data using onboard user inputdevices 930 such a touchpad, microphone, keyboard, etc., where thecomputer 902 is a portable computer, for example. These and other inputdevices are connected to the processing unit(s) 904 through input/output(I/O) device interface(s) 932 via the system bus 908, but can beconnected by other interfaces such as a parallel port, IEEE 1394 serialport, a game port, a USB port, an IR interface, etc. The I/O deviceinterface(s) 932 also facilitate the use of output peripherals 934 suchas printers, audio devices, camera devices, and so on, such as a soundcard and/or onboard audio processing capability.

One or more graphics interface(s) 936 (also commonly referred to as agraphics processing unit (GPU)) provide graphics and video signalsbetween the computer 902 and external display(s) 938 (e.g., LCD, plasma)and/or onboard displays 940 (e.g., for portable computer). The graphicsinterface(s) 936 can also be manufactured as part of the computer systemboard.

The computer 902 can operate in a networked environment (e.g., IP-based)using logical connections via a wired/wireless communications subsystem942 to one or more networks and/or other computers. The other computerscan include workstations, servers, routers, personal computers,microprocessor-based entertainment appliances, peer devices or othercommon network nodes, and typically include many or all of the elementsdescribed relative to the computer 902. The logical connections caninclude wired/wireless connectivity to a local area network (LAN), awide area network (WAN), hotspot, and so on. LAN and WAN networkingenvironments are commonplace in offices and companies and facilitateenterprise-wide computer networks, such as intranets, all of which mayconnect to a global communications network such as the Internet.

When used in a networking environment the computer 902 connects to thenetwork via a wired/wireless communication subsystem 942 (e.g., anetwork interface adapter, onboard transceiver subsystem, etc.) tocommunicate with wired/wireless networks, wired/wireless printers,wired/wireless input devices 944, and so on. The computer 902 caninclude a modem or other means for establishing communications over thenetwork. In a networked environment, programs and data relative to thecomputer 902 can be stored in the remote memory/storage device, as isassociated with a distributed system. It will be appreciated that thenetwork connections shown are exemplary and other means of establishinga communications link between the computers can be used.

The computer 902 is operable to communicate with wired/wireless devicesor entities using the radio technologies such as the IEEE 802.xx familyof standards, such as wireless devices operatively disposed in wirelesscommunication (e.g., IEEE 802.11 over-the-air modulation techniques)with, for example, a printer, scanner, desktop and/or portable computer,personal digital assistant (PDA), communications satellite, any piece ofequipment or location associated with a wirelessly detectable tag (e.g.,a kiosk, news stand, restroom), and telephone. This includes at leastWi-Fi (or Wireless Fidelity) for hotspots, WiMax, and Bluetooth™wireless technologies. Thus, the communications can be a predefinedstructure as with a conventional network or simply an ad hoccommunication between at least two devices. Wi-Fi networks use radiotechnologies called IEEE 802.11x (a, b, g, etc.) to provide secure,reliable, fast wireless connectivity. A Wi-Fi network can be used toconnect computers to each other, to the Internet, and to wire networks(which use IEEE 802.3-related media and functions).

The illustrated and described aspects can be practiced in distributedcomputing environments where certain tasks are performed by remoteprocessing devices that are linked through a communications network. Ina distributed computing environment, program modules can be located inlocal and/or remote storage and/or memory system.

What has been described above includes examples of the disclosedarchitecture. It is, of course, not possible to describe everyconceivable combination of components and/or methodologies, but one ofordinary skill in the art may recognize that many further combinationsand permutations are possible. Accordingly, the novel architecture isintended to embrace all such alterations, modifications and variationsthat fall within the spirit and scope of the appended claims.Furthermore, to the extent that the term “includes” is used in eitherthe detailed description or the claims, such term is intended to beinclusive in a manner similar to the term “comprising” as “comprising”is interpreted when employed as a transitional word in a claim.

1. A computer-implemented data restoration system having non-transitory computer readable media that store executable instructions executed by a processor, comprising: a restore component that restores a node in a topology to a restored state, the node having an identity; an identity component that changes the identity of the node to a new identity, the node appears to other nodes in the topology as a new node based on the new identity; and a synchronization component that synchronizes data from the other nodes to the node based on the new identity to bring the node to an updated state.
 2. The system of claim 1, wherein the identity component changes the identity of the node by increasing a local peer value of a key map associated with the node, and updating key maps of all topology nodes based on the new identity.
 3. The system of claim 1, wherein the synchronization component synchronizes data changes from the node to the other nodes and synchronizes changes from the other nodes to the node based on the new identity.
 4. The system of claim 1, wherein the new identity is created as an incremental increase in a local peer value and new node identifier.
 5. The system of claim 1, wherein the restore component restores data item metadata based on the restored node, and data item metadata across scopes that include the data item.
 6. A computer-implemented data restoration method executed by a processor, comprising: restoring a node in a topology to a restored state with restored data, the node having an identity; changing the identity of the node to a new identity, the node appears to other nodes in the topology as a new node based on the new identity; and synchronizing prior data of the node from the other nodes to the node based on the new identity to bring the node to an updated state.
 7. The method of claim 6, further comprising changing the identity of the node by changing a key map associated with the node.
 8. The method of claim 7, further comprising changing a local peer parameter as part of the key map to change the node identity.
 9. The method of claim 6, further comprising changing the identity of the node by increasing a key value of the key map.
 10. The method of claim 6, further comprising updating key maps of the other nodes to include the new node identity.
 11. The method of claim 6, further comprising applying restoring, changing, and synchronizing of the new node to restore the new node if the new node fails.
 12. The method of claim 6, further comprising updating item metadata to correlate with the updated state of the data items of the node, for change enumeration.
 13. The method of claim 6, further comprising updating item metadata of a data item across multiple scopes that include the data item.
 14. A computer-implemented data restoration method employing a processor and memory, comprising: restoring a node in a topology to a restored state with restored data of data items, the node having an identity; changing the identity of the node to a new identity, the node appears to other nodes in the topology as a new node based on the new identity; synchronizing data from the other nodes to the node based on the new identity to bring the node to an updated state; and updating item metadata of a data item across multiple scopes that include the data item.
 15. The method of claim 14, further comprising changing the identity of the node by changing a local peer parameter of a key map associated with the node.
 16. The method of claim 15, further comprising changing the identity of the node by increasing a key value of the key map.
 17. The method of claim 14, further comprising updating key maps of the other nodes to include the new node identity.
 18. The method of claim 14, further comprising updating data item metadata to correlate with updated state of the data of the node for change enumeration.
 19. The method of claim 14, further comprising updating item metadata of a data item across multiple scopes that include the data item.
 20. The method of claim 14, further comprising restoring, changing, synchronizing, and updating to restore the new node when the new node fails. 